منابع مشابه
Refined quicksort asymptotics
The complexity of the Quicksort algorithm is usually measured by the number of key comparisons used during its execution. When operating on a list of n data, permuted uniformly at random, the appropriately normalized complexity Yn is known to converge almost surely to a non-degenerate random limit Y. This assumes a natural embedding of all Yn on one probability space, e.g., via random binary se...
متن کاملQuicksort asymptotics
The number of comparisons Xn used by Quicksort to sort an array of n distinct numbers has mean μn of order n log n and standard deviation of order n. Using different methods, Régnier and Rösler each showed that the normalized variate Yn := (Xn−μn)/n converges in distribution, say to Y ; the distribution of Y can be characterized as the unique fixed point with zero mean of a certain distribution...
متن کاملA refined Quicksort asymptotic
The complexity of the Quicksort algorithm is usually measured by the number of key comparisons used during its execution. When operating on a list of n data, permuted uniformly at random, the appropriately normalized complexity Yn is known to converge almost surely to a non-degenerate random limit Y. This assumes a natural embedding of all Yn on one probability space, e.g., via random binary se...
متن کاملAppendix to Quicksort Asymptotics
This appendix to [2] contains a proof of the improved estimates in Remark 7.3 of that paper for the moment generating function of the (normalized) number of comparisons in Quicksort. AMS 2000 subject classifications. Primary 68W40; secondary 68P10, 60F05, 60E10. Date. May 22, 2001. Research supported by NSF grant DMS–9803780, and by The Johns Hopkins University’s Acheson J. Duncan Fund for the ...
متن کاملM ay 2 00 1 Quicksort Asymptotics
The number of comparisons X n used by Quicksort to sort an array of n distinct numbers has mean µ n of order n log n and standard deviation of order n. Using different methods, Régnier and Rösler each showed that the normalized variate Y n := (X n −µ n)/n converges in distribution, say to Y ; the distribution of Y can be characterized as the unique fixed point with zero mean of a certain distri...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Random Structures & Algorithms
سال: 2013
ISSN: 1042-9832
DOI: 10.1002/rsa.20497